A multi-threshold secret image sharing scheme based on MSP
نویسندگان
چکیده
0167-8655/$ see front matter 2012 Published by http://dx.doi.org/10.1016/j.patrec.2012.04.010 ⇑ Corresponding author. Address: Department of Computer Science, Feng Chia University, No. 100 We 40724, Taiwan. Tel.: +886 4 24517250x3790; fax: +8 E-mail addresses: [email protected] (C. Guo Chang). In this paper, we consider the problem of secret image sharing in groups with multi-threshold access structure. In such a case, multiple secret images can be shared among a group of participants, and each secret image is associated with a (potentially different) access structure. We employ Hsu et al.’s multisecret sharing scheme based on monotone span programs (MSP) to propose a multi-threshold secret image sharing scheme. In our scheme, according to the real situation, we pre-defined the corresponding access structures. Using Hsu et al.’s method, we can achieve shadow data from multiple secret images according to these access structures. Then, we utilize the least significant bits (LSB) replacement to embed these shadow data into the cover image. Each secret image can be reconstructed losslessly by collecting a corresponding qualified subset of the shadow images. The experimental results demonstrate that the proposed scheme is feasible and efficient. 2012 Published by Elsevier B.V.
منابع مشابه
An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملSecurity Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملOn the design and security of a lattice-based threshold secret sharing scheme
In this paper, we introduce a method of threshold secret sharing scheme (TSSS) in which secret reconstruction is based on Babai's nearest plane algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there are no quantum threats to these channels. A solution to this problem can be utilization of lattice-based cryptosystems for these channe...
متن کاملMulti-Threshold Visual Secret Sharing
Visual cryptography (VC) has been developed extensively based on its practicability. These schemes can encode a black-and-white secret image into several shadow images, and, by stacking a certain number of shadow images, can retrieve the secret image through the human visual system. In this paper, we employ Hsu et al.’s ideal multi-threshold secret sharing scheme based on monotone span programs...
متن کاملComputationally secure multiple secret sharing: models, schemes, and formal security analysis
A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition Letters
دوره 33 شماره
صفحات -
تاریخ انتشار 2012